Local search for a cargo assembly planning problem

Title: Local search for a cargo assembly planning problem
Creator: Belov, Gleb; Boland, Natashia; Savelsbergh, Martin W. P.; Stuckey, Peter J.
Relation: 11th International Conference, CPAIOR 2014. Integration of AI and OR Techniques in Constraint Programming: 11th International Conference, CPAIOR 2014, Cork, Ireland, May 19-23, 2014. Proceedings (Cork, Ireland 19-23 May, 2014) p. 159-175
Publisher Link: http://dx.doi.org/10.1007/978-3-319-07046-9_12
Publisher: Springer Verlag
Resource Type: conference paper
Date: 2014
Description: We consider a real-world cargo assembly planning problem arising in a coal supply chain. The cargoes are built on the stockyard at a port terminal from coal delivered by trains. Then the cargoes are loaded onto vessels. Only a limited number of arriving vessels is known in advance. The goal is to minimize the average delay time of the vessels over a long planning period. We model the problem in the MiniZinc constraint programming language and design a large neighbourhood search scheme. We compare against (an extended version of) a greedy heuristic for the same problem.
Subject: packing; scheduling; resource constraint; large neighbourhood search; constraint programming; adaptive greedy; visibility horizon
Identifier: http://hdl.handle.net/1959.13/1304210
Identifier: uon:20828
Identifier: ISBN:9783319070452
Language: eng
Reviewed

		Thumbnail	File	Description	Size	Format